Proof Certification in Zenon Modulo: When Achilles Uses Deduction Modulo to Outrun the Tortoise with Shorter Steps∗
نویسندگان
چکیده
We present the certifying part of the Zenon Modulo automated theorem prover, which is an extension of the Zenon tableau-based first order automated theorem prover to deduction modulo. The theory of deduction modulo is an extension of predicate calculus, which allows us to rewrite terms as well as propositions, and which is well suited for proof search in axiomatic theories, as it turns axioms into rewrite rules. In addition, deduction modulo allows Zenon Modulo to compress proofs by making computations implicit in proofs. To certify these proofs, we use Dedukti, an external proof checker for the λΠ-calculus modulo, which can deal natively with proofs in deduction modulo. To assess our approach, we rely on some experimental results obtained on the benchmarks provided by the TPTP library.
منابع مشابه
Zenon Modulo: When Achilles Outruns the Tortoise Using Deduction Modulo
We propose an extension of the tableau-based first order automated theorem prover Zenon to deduction modulo. The theory of deduction modulo is an extension of predicate calculus, which allows us to rewrite terms as well as propositions, and which is well suited for proof search in axiomatic theories, as it turns axioms into rewrite rules. We also present a heuristic to perform this latter step ...
متن کاملAutomated Deduction in the B Set Theory using Typed Proof Search and Deduction Modulo
We introduce an encoding of the set theory of the B method using polymorphic types and deduction modulo, which is used for the automated verification of proof obligations in the framework of the BWare project. Deduction modulo is an extension of predicate calculus with rewriting both on terms and propositions. It is well suited for proof search in theories because it turns many axioms into rewr...
متن کاملChecking Zenon Modulo Proofs in Dedukti
Dedukti has been proposed as a universal proof checker. It is a logical framework based on the λΠcalculus modulo that is used as a backend to verify proofs coming from theorem provers, especially those implementing some form of rewriting. We present a shallow embedding into Dedukti of proofs produced by Zenon Modulo, an extension of the tableau-based first-order theorem prover Zenon to deductio...
متن کاملAutomated Deduction in the B Set Theory using Deduction Modulo
We introduce a new encoding of the set theory of the B method based on deduction modulo. The theory of deduction modulo is an extension of predicate calculus that includes rewriting on both terms and propositions, which is well suited for proof search in axiomatic theories, as it turns many axioms into rewrite rules. We also present Zenon Modulo and iProver Modulo, two automated theorem provers...
متن کاملML Pattern-Matching, Recursion, and Rewriting: From FoCaLiZe to Dedukti
The programming environment FoCaLiZe allows the user to specify, implement, and prove programs. It produces as output OCaml executable programs along with proof hints that help the first-order theorem prover Zenon to find proofs. In the actual version, those proofs found by Zenon are verified by Coq. In this paper we propose to extend the FoCaLiZe compiler by a backend to the Dedukti language –...
متن کامل